Bravais colourings of planar modules with N-fold symmetry

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Bravais colourings of planar modules with N -fold symmetry

The first step in investigating colour symmetries for periodic and aperiodic systems is the determination of all colouring schemes that are compatible with the symmetry group of the underlying structure, or with a subgroup of it. For an important class of colourings of planar structures, this mainly combinatorial question can be addressed with methods of algebraic number theory. We present the ...

متن کامل

Multiple planar coincidences with N-fold symmetry

Planar coincidence site lattices and modules with N -fold symmetry are well understood in a formulation based on cyclotomic fields, in particular for the class number one case, where they appear as certain principal ideals in the corresponding ring of integers. We extend this approach to multiple coincidences, which apply to triple or multiple junctions. In particular, we give explicit results ...

متن کامل

Nonrepetitive Colourings of Planar Graphs with O(log n) Colours

A vertex colouring of a graph is nonrepetitive if there is no path for which the first half of the path is assigned the same sequence of colours as the second half. The nonrepetitive chromatic number of a graph G is the minimum integer k such that G has a nonrepetitive k-colouring. Whether planar graphs have bounded nonrepetitive chromatic number is one of the most important open problems in th...

متن کامل

A note on n-tuple colourings and circular colourings of planar graphs with large odd girth

International Journal of Computer Mathematics Publication details, including instructions for authors and subscription information: http://www.informaworld.com/smpp/title~content=t713455451 A note on n-tuple colourings and circular colourings of planar graphs with large odd girth P. šparl ab; J. žerovnik ac a IMFM, Slovenia b FG, University of Maribor, Slovenia c FS, University of Maribor, Slov...

متن کامل

A Computer Search for Planar Substitution Tilings with n-Fold Rotational Symmetry

We describe a computer algorithm that searches for substitution rules on a set of triangles, the angles of which are all integer multiples of π/n. We find new substitution rules admitting 7-fold rotational symmetry at many different inflation factors.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Zeitschrift für Kristallographie - Crystalline Materials

سال: 2004

ISSN: 2196-7105,2194-4946

DOI: 10.1524/zkri.219.2.72.26322